System and method for generating optimized binary representation of an object tree

ABSTRACT

A system and related techniques accept extensible application markup language (XAML) inputs corresponding to object trees, such as those representing user interface elements, and map those inputs to a binary construct. The XAML inputs may illustratively include, for example, user interface elements such as dialog boxes having defined length, color, input sections and so forth. A mapping engine may generate tokenized binary outputs representing the XAML file input and ultimately the associated user interface or other object. The binary representation generated by the mapping engine may be optimized in multiple ways, including to encode dimension information such as length, width etc. of dialog boxes or other elements in the binary representation without a necessity for explicit definition. Other optimizations include the type indexing of data types when a novel instance of the type is first encountered, and embedding loader definitions to load the object or data reflected in the binary representation without having to do a lookup against loader lists. Because the resulting binary representation is more compact than the corresponding XAML input and is optimized for certain operations, operating system and application interfaces may load and present more quickly than conventional XML-type files. The binary representation may be exposed through APIs to calling application, operating system or other programs.

CROSS-REFERENCE TO RELATED APPLICATION

The subject matter of this application is related to the subject matter of U.S. patent application Ser. No. ______ entitled “Method and System for Mapping Tags to Classes Using Name Spaces” filed of even date herewith, which application is assigned or under obligation of assignment to the same entity as this application, and which application is incorporated herein by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

FIELD OF THE INVENTION

The invention relates to the field of computer programming, and more particularly to a platform for transforming extensible application markup language code into compact, optimized binary representations of those sources, including representations of user interface and other elements.

BACKGROUND OF THE INVENTION

The use of extensible markup language (XML) technology in browser and other technology has expanded and continues to grow. Because XML represents documents and other data and objects in an innately hierarchical or tree-based fashion, ordered relationships, parsing, searching and other operations and constructs may be relatively easily or naturally constructed and used. The use of XML has consequently progressed from browser applications to database, operating system and other applications. XML may now be extended to supporting the user interface and other components of systems and applications for example through the use of extensible application markup language (XAML), which permits programmers to encode operating system, application and other elements in object-rooted hierarchical format.

However, while XML has enjoyed increasingly standardized use in a range of applications, the platform is not without certain drawbacks or disadvantages. Significant among those are the fact that XML-based representations of documents or objects are typically larger than some other formats, such as binary files or others. While computer storage and network capacity continue to grow, even with comparatively rich client or network resources XML/XAML-based data may demand significant amounts of time to load onto a client machine or download over a network. Application load times are a facet of computer performance most closely perceived by users as affecting system responsiveness. So while the deployment of XML and related technology continues to grow, techniques to make the platform more efficient in storage and use are desirable. Other disadvantages of conventional XML-related technology exist.

SUMMARY OF THE INVENTION

The invention overcoming these and other problems in the art relates in one regard to a system and method for generating an optimized binary representation of an object tree, in which a mapping engine accepts an extensible application markup language input, for instance a XAML representation of a binary object tree corresponding to user interface elements. The mapping engine may transform the relatively verbose XAML construct for user interface elements or other objects to a tokenized binary representation of that same XAML and associated object. In embodiments, the binary representation of the XAML and associated object may be made more compact or otherwise optimized for storage, loading and transmission through various techniques. Optimization mechanisms may include for instance the encoding of object dimension information in the binary output stream, for example to encode the length and width of a dialog box or other element by positioning a byte representing length, width etc. in a predefined place in the binary stream. Other binary optimizations include the type indexing of novel data types in the data stream in the first instance they are encountered, and the embedding of identifiers for loaders which may called to load an object encapsulated in the binary output stream.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an overall architecture in which an embodiment of the optimized binary generator of the invention may operate.

FIG. 2 illustrates an information record schema associated with the binary representation output generated according to embodiments of the invention.

FIG. 3 illustrates a structure record schema associated with the binary representation output generated according to embodiments of the invention.

FIG. 4 illustrates binary records associated with an illustrative output generated according to embodiments of the invention.

FIG. 5 illustrates a binary serialization generated according to embodiments of the invention.

FIG. 6 illustrates a reconstruction of an object from a binary representation, according to embodiments of the invention.

FIG. 7 illustrates a flowchart of processing to generate a converted binary representation of source XAML, according to embodiments of the invention.

FIG. 8 illustrates a flowchart of processing to read out a binary representation of a XAML-based object to generate a representation of that object, according to embodiments of the invention.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 1 illustrates an architecture in which a system and method for generating an optimized binary representation of an object tree may operate, according to an embodiment of the invention. As illustrated in that figure, in embodiments source XAML 102 may be used to represent or generate a set of XAML nodes 104, those nodes corresponding to the structure of an object tree 110. The object tree 110 may represent, for example, user interface elements such as dialog boxes, icons, buttons, borders or other elements or resources used in operating systems or other code. According to the invention, the XAML nodes 104 may be transmitted to a mapping engine 106 as an input for transformation to binary form.

More specifically, mapping engine 106 may include parser logic, tables and associated resources to detect incoming XAML data in the form of XAML nodes 104 from source XAML 102 or otherwise, and generate a corresponding binary representation 108 of those XAML nodes 104. The binary representation 108 may in one regard encapsulate the information characterizing object tree 110 in binary form. In embodiments, the binary representation 108 may include tokenized decompositions of XAML data, with common assembly, attribute and other information hoisted to common files to make the representation more compact.

As illustratively shown in FIG. 1, the binary representation 108 may consist of at least two components, namely information records 112 and structure records 114. Those records as illustrated may themselves embed fields including for identifiers to indicate whether a given record is of information, structure or other type. In embodiments size fields may likewise indicate the overall size of one or more records in the set of binary records 130, but formats may vary. In embodiments, the binary representation 108 may be generated from a live object tree as opposed to a stored file containing source XAML 102 or other data. The binary representation 108 may be transmitted to a binary reader 116 or receive data from a binary writer 118, for purposes of interfacing to other resources. Mapping engine 106 may likewise communicate with or make use of binary reader 116 or binary writer 118 to map or generate binary objects or outputs.

In terms of more detailed composition of the records making up binary representation 108, FIG. 2 illustrates an information record schema 126 for information records 112, which as shown includes assembly information, type information and attribute information used to define the types, attributes and other information used to load and generate the eventual representation of object tree 110. FIG. 3 conversely illustrates a structure record schema 128 for structure records 114, which as shown includes various classes of tags, tokens and other identifiers, attributes and placeholders which may be used to build the representation of object tree 110. Other schema and interior attributes may be used in the information records 112 and structure records 114.

It may be noted that in embodiments, the binary representation 108 may be constructed such that the information records 112 are always available before they are referenced by any structure records 114. According to the invention in one regard, as noted the information records 112 may contain an ID field which is unique to a given binary representation 108 and may be used to uniquely identify assemblies, types and attributes. When structure records 114 are written out, they may contain an index of associated ID records for the type and attribute information. For example, consider the following XAML expression, which may form an instance of source XAML 102:

Expression 1 <DockPanel xmlns=” http://shcmeas.microsoft.com/2003/xaml”> <Button Background=”Blue”/> </DockPanel>

Upon receipt by the mapping engine 106, this source XAML 102 may generate the associated set of binary records 130 illustrated in FIG. 4. In the illustrative record, it may be noted that every information record 112 is written out before it is referred to. When reading the set of binary records 130 associated with binary representation 108 via binary reader 116 or otherwise, hoisted type, assembly and attribute information may be used to build tables of information used to construct a representation of the object tree 110 and set properties.

In embodiments, the set of binary records 130 may be further compressed or optimized by use of implicit structure records 114, that is, by employing one or more of structure records 114 whose type is known by the system and is fixed. According to such embodiments in one regard, the structure records 114 which are implicitly defined need not be actually written out by or in the binary representation 108 and associated components, since their type is understood. For example in operating system environments, certain user interface types and controls may always be incorporated into the set of available objects. Those types or controls may include common interface constructs such as a button, cursor or others.

In such instances, if a binary representation 108 or constituent record wishes to reference a “button” type control, it may not be necessary to explicitly write out a button type record, since a known type ID may be reserved for that or other known operating system-related or other classes. For example, rather than write out a record of the variety “TypeInfo−ID=2 . . . ” as illustratively shown in FIG. 4, a StartElement record for a button element may simply contain a negative number entry of “ID=−12” or other identifier understood to reference that class. Other tags or identifiers may be used. Implicit typing in this fashion may further optimize storage space, transmission time and other performance factors.

According to another aspect of the invention, the binary representation 108 may again be optimized in regards to the fact that an attribute in XAML may typically be a property on an object. The definer of that property may be the object itself, or some other class. When the defining class is external to the object, locating that class can be expensive in terms of load time and other performance measures. However according to embodiments of the invention, identification of associated classes may be performed during the mapping process and encoded in the binary representation 108 itself. This encoding may be reflected as the type ID in an attribute information record.

According to embodiments of the invention in another regard, the mapping engine 106 and other platform resources may generate and transmit the binary representation 108 in serialized form. During serial transmission, storing a string for a property value each time it appears may be inefficient, because of the space required for character information and because executing a parser (such as TypeConverter used in the Microsoft Windows™ family) at runtime to parse the string and find a corresponding loader or other resource may be costly. It may therefore offer gains in loading and other efficiency to have the binary object which is represented by the embedded string to perform a custom serialization to its own privately defined binary format. For example, Length type may be used to provide Width and Height for user interface controls, as in the following example source XAML 102:

Expression 2 <ButtonWidth=“100px” Height=“50px”/>

If a type implements serialization interfaces configured to be consistent with the invention, it may be called upon when a stream of binary representation 108 is constructed to serialize itself directly into the stream in its own custom defined format resulting in compact storage and transmission requirements. The Length (or other dimensional) type can exploit this type of capability effectively, resulting in typical cases in a requirement of only 1 byte to specify the length of an object in a binary stream. FIG. 5 for example shows illustrative code for performing a serialization for a Length type. Other implementing code is possible. The binary representation 108 and associated may records may thus likewise be optimized by generating a type index for novel types (such as Length) upon encountering the first instance of those types. Loading times may also therefore be enhanced.

In terms of use of the binary representation 108 once it is generated according to embodiments of the invention, as illustrated in FIG. 6 the mapping engine 106 may likewise communicate with a binary reader 116, that module being configured to receive and transmit the binary representation 108 and communicate with a mapping table 134 and other resources. Mapping table 134 may contain lookup tables or other entries storing common attributes, types and other information which may be used to extract hoisted or encoded information from binary representation 108. As shown in FIG. 6, the binary reader 116 may for instance be invoked to read the binary representation 108 and generate a reconstructed object 120 corresponding to object tree 110 or other output. That output may be used for example to expose a dialog box or other user interface element or other object to an application programming interface 124. The application programming interface 124 may interface to applications such as browsers, databases or other client or network applications to call system or other resources. In embodiments, as illustrated the binary reader 116 may also generate a text representation 122 of the object tree 110 for transmission to a text-related application programming interface 136 or other applications or resources.

FIG. 7 illustrates aspects of processing which may be used to generate a converted binary representation of source XAML 102, according to embodiments of the invention. In step 702, processing may begin. In step 704, source XAML 102 may be loaded or opened in mapping engine 106 or otherwise. In step 706, the next (or initial) XML token may be converted to a XAML token. In step 708, the XAML token may be converted to a binary record, for instance as part of the set of binary records 130. In step 710, the binary representation record may be written to the set of binary records 130 or other locations, for instance using binary writer 118. In step 712, a determination may be made whether there is additional XML to be read from source XAML 102 or otherwise. If there is additional XML input to be read, processing may return to step 706 to map the next XML token to a XAML token. If there is no additional XML input to be read, processing may proceed to step 714 where a file containing the set of binary records 130 may be closed. In step 716, processing may repeat, terminate or return to a prior processing point.

FIG. 8 illustrates aspects of processing which may be used to read out a binary representation 108 of a XAML-based object such as an object tree 110 to generate a representation of that object, according to embodiments of the invention. As shown in that figure, in step 802, processing may begin. In step 804, a binary representation 108 may be accessed or opened, for example from a file or a data stream. In step 806, a record in the set of binary records 130 contained in or associated with binary representation 108 may be read, for instance using binary reader 116. In step 808, a determination may be made whether the current record is an information record, as opposed to a structure record.

If the current record is determined to be an information record, processing may proceed to step 810 in which mapping table 134 may be loaded with information from or associated with the information record. Processing may then proceed to step 816 where a determination may be made whether the end of the file or stream has been encountered. If the end of the file or stream has been encountered, control may proceed to step 818 where processing may repeat, terminate or return to a prior processing point. If the determination in step 816 is that the end of the file or data stream has not been reached, then processing may conversely return to step 806 to read a next binary record in the set of binary records 130.

If in step 808 the current record is determined to not be an information record, processing may proceed to step 812 where the mapping table 134 may be used to identify the structure record or a type of the structure record being processed, for instance as part of the set of structure records 114. In step 814, an object such as an object tree 110 may be generated corresponding to the identified structure record, for instance from a set of classes for user interface or other applications. It may be noted that in embodiments a structure record may identify properties on objects, rather than an object directly. In such cases, in step 814 properties on an object may alternatively be extracted, for instance using a custom type converter or other resources. Processing may then proceed to step 816, where a test may be made for end-of-file conditions as described.

The foregoing description of the invention is illustrative, and modifications in configuration and implementation will occur to persons skilled in the art. For instance, while the invention has generally been described in terms of the generation of a binary representation 108 of source XAML 102 which both exist or load on a client machine, in embodiments either of the source XAML 102, XAML nodes 104, binary representation 108 and binary tree 110 could, for instance, be distributed locally or remotely, for instance to serve binary representation 108 from a remote server to a client or other machine.

Similarly, while the invention has in embodiments been described as encapsulating user interface elements originally encoded in a binary application markup language such as XAML, the mapping from source input to binary format may in instances be performed on other code, data or interfaces. Other hardware, software or other resources described as singular may in embodiments be distributed, and similarly in embodiments resources described as distributed may be combined. Further, while the invention has in one regard been illustratively described in terms of a binary representation 108 decomposed into information records 112 and structure records 114, in implementations the types and schema for the actual binary format may vary. The type and nature of optimizations performed on or used to produce binary representation 108 may moreover be extended beyond the indexing and other types described. The scope of the invention is accordingly intended to be limited only by the following claims. 

1. A system for generating an optimized binary representation of an object tree, comprising: an input interface to receive markup language information corresponding to an object tree; a mapping engine, the mapping engine communicating with the input interface to receive the markup language information and generate an optimized binary representation of the markup language information; and an output interface, communicating with the mapping engine, the output interface exposing the optimized binary representation to external resources.
 2. A system according to claim 1, wherein the markup language information comprises extensible application markup language information.
 3. A system according to claim 1, wherein the object tree corresponds to user interface elements.
 4. A system according to claim 1, wherein the optimization comprises optimizing the binary representation at least by encoding dimension information in the binary representation.
 5. A system according to claim 4, wherein the dimension information comprises at least one of a length field and a width field.
 6. A system according to claim 1, wherein the output interface comprises a serial interface.
 7. A system according to claim 6, wherein the serial interface communicates a serialized binary representation to a client machine.
 8. A system according to claim 1, wherein the external resources to which the binary representation is exposed comprise application programming interfaces.
 9. A system according to claim 1, wherein the optimization comprises indexing the first instance of a novel object type in the binary representation.
 10. A system according to claim 1, wherein the optimization comprises embedding an identifier to invoke an associated loader in the binary representation.
 11. A method of generating an optimized binary representation of an object tree, comprising: receiving markup language information corresponding to an object tree; generating an optimized binary representation of the markup language information; and exposing the optimized binary representation to external resources.
 12. A method according to claim 11, wherein the markup language information comprises extensible application markup language information.
 13. A method according to claim 11, wherein the object tree corresponds to user interface elements.
 14. A system according to claim 11, wherein the optimization comprises at least one of optimizing the binary representation at least by encoding dimension information in the binary representation, indexing the first instance of a novel object type in the optimized binary representation, and embedding an identifier to invoke an associated loader in the binary representation.
 15. A method according to claim 11, wherein the step of exposing comprises exposing the optimized binary representation via a comprises a serial interface.
 16. A method according to claim 11, wherein the external resources to which the binary representation is exposed comprise application programming interfaces.
 17. An optimized binary representation of an object tree, the optimized binary representation being generating according to a method of: receiving markup language information corresponding to an object tree; generating an optimized binary representation of the markup language information; and exposing the optimized binary representation to external resources.
 18. An optimized binary representation according to claim 17, wherein the markup language information comprises extensible application markup language information.
 19. An optimized binary representation according to claim 17, wherein the object tree corresponds to user interface elements.
 20. An optimized binary representation according to claim 17, wherein the optimization comprises at least one of optimizing the binary representation at least by encoding dimension information in the binary representation, indexing the first instance of a novel object type in the optimized binary representation, and embedding an identifier to invoke an associated loader in the binary representation
 21. An optimized binary representation according to claim 17, wherein the step of exposing comprises exposing the optimized binary representation via a serial interface.
 22. An optimized binary representation method according to claim 17, wherein the external resources to which the binary representation is exposed comprise application programming interfaces.
 23. A system for generating an optimized binary representation of an object tree, comprising: input interface means to receive markup language information corresponding to an object tree; mapping means, the mapping means communicating with the input interface means to receive the markup language information and generate an optimized binary representation of the markup language information; and output interface means, communicating with the mapping means, the output interface means exposing the optimized binary representation to external resources.
 24. A system according to claim 23, wherein the markup language information comprises extensible application markup language information.
 25. A system according to claim 23, wherein the object tree corresponds to user interface elements.
 26. A system according to claim 23, wherein the optimization comprises at least one of optimizing the binary representation at least by encoding dimension information in the binary representation, indexing the first instance of a novel object type in the optimized binary representation, and embedding an identifier to invoke an associated loader in the binary representation.
 27. A system according to claim 23, wherein the output interface means comprises serial interface means.
 28. A system according to claim 23, wherein the external resources to which the binary representation is exposed comprise application programming interfaces.
 29. A computer readable medium, the computer readable medium being readable to execute a method of generating an optimized binary representation of an object tree, the method comprising: receiving markup language information corresponding to an object tree; generating an optimized binary representation of the markup language information; and exposing the optimized binary representation to external resources.
 30. A computer readable medium according to claim 29, wherein the markup language information comprises extensible application markup language information.
 31. A computer readable medium according to claim 29, wherein the object tree corresponds to user interface elements. 